On the Security of a Realization of Cryptosystem Mst3

نویسندگان

  • Spyros S. Magliveras
  • Tran van Trung
  • Pavol Zajac
  • SPYROS S. MAGLIVERAS
  • PAVOL ZAJAC
چکیده

A new type of public key cryptosystem, called MST3, has been recently developed on the basis of logarithmic signatures and covers of finite groups. The Suzuki 2-groups have been suggested for a possible realization of the generic version of MST3. On one hand, due to their structure, the Suzuki 2-groups allow one to study the security complexity of the system, on the other hand they possess a simple presentation allowing for an efficient implementation of the system. In this paper we present a detailed study of the security of this realization of MST3. We prove a new general bound for the security complexity of MST3. This bound has size q = 2, where q is the order of the underlying finite field Fq, on which the Suzuki 2-group A(m, θ) is defined. Further, by exploiting properties of the group operation in the Suzuki 2-groups, as well as a special property of canonical transversal logarithmic signatures for elementary abelian 2-groups, we show that canonical transversal logarithmic signatures are unfit to use in this realization of MST3.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Public key cryptosystem MST3: cryptanalysis and realization

A new type of public key cryptosystem, called MST3, has been recently introduced on the basis of covers and logarithmic signatures for non-abelian finite groups. The class of Suzuki 2-groups has been proposed for a possible realization of the generic scheme. Due to their simple structure, the groups enable us to study the security of the system and also provide an efficient implementation. An e...

متن کامل

On public-key cryptosystem MST3 and its realization

8th Central European Conference on Cryptography 2008 1 versions. Finally, we discuss the choice of suitable parameters for an efficient realization of thesystem and its practical usage.References [1] S. S. Magliveras, D. R. Stinson and Tran van Trung, New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups, J. Cryptology, 15 (2002), 28...

متن کامل

QTRU: quaternionic version of the NTRU public-key cryptosystems

In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...

متن کامل

Improving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes

This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...

متن کامل

EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations

GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007